Remark on the formula by Rakhmanov and Steklov's conjecture
نویسنده
چکیده
The conjecture by Steklov was solved negatively by Rakhmanov in 1979. His original proof was based on the formula for orthogonal polynomial obtained by adding point masses to the measure of orthogonality. In this note, we show how this polynomial can be obtained by applying the method developed recently for proving the sharp lower bounds for the problem by Steklov.
منابع مشابه
A Remark about Mahler’s Conjecture and the Maximum Value of Box Splines
In this paper, we recast a special case of Mahler’c conjecture by the maximum value of box splines. This is the case of polytopes with at most 2n + 2 facets. An asymptotic formula for univariate box splines is given. Based on the formula, Mahler’s conjecture is proved in this case provided n is big enough.
متن کاملOn a Conjecture of E.a. Rakhmanov
It is shown that a conjecture of E.A. Rakhmanov is true concerning the zero distribution of orthogonal polynomials with respect to a measure having a discrete real support. We also discuss the case of extremal polynomials with respect to some discrete L p {norm, 0 < p 1, and give an extension to complex supports. Furthermore, we present properties of weighted Fekete points with respect to discr...
متن کاملOn Schur parameters in Steklov's problem
We study the recursion (aka Schur) parameters for monic polynomials orthogonal on the unit circle with respect to a weight which provides negative answer to the conjecture of Steklov.
متن کاملTowards a Human Proof of Gessel’s Conjecture
We interpret walks in the first quadrant with steps {(1, 1), (1, 0), (−1, 0), (−1,−1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks using the steps above, beginning and ending at the origin. We give an explicit formula for a restricted class of such words using a correspondence between such words and Dyck pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Approximation Theory
دوره 205 شماره
صفحات -
تاریخ انتشار 2016